Computing the Least Common Subsumer w.r.t. a Background Terminology
نویسندگان
چکیده
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the lcs w.r.t. a background terminology.
منابع مشابه
Computing the Least Common
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions ...
متن کاملComputing the least common subsumer w . r . t . a background
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions ...
متن کاملComputing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics
Computing the least common subsumer (lcs) is one of the most prominent non-standard inference in description logics. Baader, Küsters, and Molitor have shown that the lcs of concept descriptions in the description logic EL always exists and can be computed in polynomial time. In the present paper, we try to extend this result from concept descriptions to concepts defined in a (possibly cyclic) E...
متن کاملPushing the Sonic Border — Sonic 1.0
This paper reports on extensions of the Description Logics non-standard inference system Sonic. The recent contributions to the system are two-fold. Firstly, Sonic is extended by two new of non-standard inferences, namely, implementations of the good common subsumer w.r.t. a background terminology and a heuristics for computing a minimal rewriting. Secondly, Sonic is available as a plugin for t...
متن کاملComputing the lcs w.r.t. General EL+-TBoxes
Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general EL-TBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL-TBoxes. We show decidability of the existence in PTime and polynomial bounds on the maximal role-depth of the lcs, which in turn yields a c...
متن کامل